Data compression with factor automata
نویسندگان
چکیده
منابع مشابه
Data Compression and Encryption Using Cellular Automata Transforms
1 Original paper appeared in Engng. Applic. Artif. Intell., Vol. 10, No. 6, pp. 581-591, 1997. Abstract A family of basis functions, generated from the evolving states of Cellular Automata (CA), is used to compress and encrypt data. The operations required in encoding and decoding the data are described under the umbrella Cellular Automata Transforms (CAT). There is a huge number of these trans...
متن کاملTranslating the EAH Data Compression Algorithm into Automata Theory
Adaptive codes have been introduced in [5] as a new class of non-standard variablelength codes. These codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. A new data compression algorithm, called EAH, has been introduced in [7], where we have behaviorally shown that for a large class of input data strings, this algorithm ...
متن کاملCompror: On-line lossless data compression with a factor oracle
We present in this article a linear time and space data compression method. This method, based on a factor oracle and the computation of the length of repeated suffixes, is easy to implement, fast and gives good compression ratios. 2001 Elsevier Science B.V. All rights reserved.
متن کاملMonitoring with Data Automata
We present a form of automaton, referred to as data automata, suited for monitoring sequences of data-carrying events, for example emitted by an executing software system. This form of automata allows states to be parameterized with data, forming named records, which are stored in an efficiently indexed data structure, a form of database. This very explicit approach differs from other automaton...
متن کاملPath Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compression. The idea behind the path compression consists in identifying a path (or a set of paths) on which a process executes a sequence of transitions that do not influence a property being verified, and replacing this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90144-5